Dynamic Disclosure Monitor (D2Mon): An Improved Query Processing Solution

نویسندگان

  • Tyrone S. Toland
  • Csilla Farkas
  • Caroline M. Eastman
چکیده

The Dynamic Disclosure Monitor (DMon) is a security mechanism that executes during query processing time to prevent sensitive data from being inferred. A limitation of DMon is that it unnecessarily examines the entire history database in computing inferences. In this paper, we present a process that can be used to reduce the number of tuples that must be examined in computing inferences during query processing time. In particular, we show how a priori knowledge of a database dependency can be used to reduce the search space of a relation when applying database dependencies. Using the database dependencies, we develop a process that forms an index table into the database that identifies those tuples that can be used in satisfying database dependencies. We show how this process can be used to extend DMon to reduce the number of tuples that must be examined in the history database when computing inferences. We further show that inferences that are computed by DMon using our extension are sound and complete.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient solution for management of pre-distribution in wireless sensor networks

A sensor node is composed of different parts including processing units, sensor, transmitter, receiver, and security unit. There are many nodes in a sensor unit. These networks can be used for military, industrial, medicine, environmental, house, and many other applications. These nodes may be established in the lands of enemies to monitor the relations. Hence, it is important to consider conse...

متن کامل

Building Disclosure Risk Aware Query Optimizers for Relational Databases

Many DBMS products in the market provide built in encryption support to deal with the security concerns of the organizations. This solution is quite effective in preventing data leakage from compromised/stolen storage devices. However, recent studies show that a significant part of the leaked records have been done so by using specialized malwares that can access the main memory of systems. The...

متن کامل

An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine

In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...

متن کامل

An Interactive Query Implementation over High Precision Progressive Query Scheme

The recently proposed Progressive Query method is a dynamic retrieval technique, which is mainly designed to bring an effective solution especially for queries on large-scale multimedia databases and furthermore to provide periodic fractional query retrievals along with the ongoing query process. In this way it achieves a series of sub-query results that will eventually be converging to the ful...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005